Characterization of forcibly k-variegated degree sequences, k⩾3
نویسندگان
چکیده
منابع مشابه
An efficient algorithm to test forcibly-connectedness of graphical degree sequences
We present an algorithm to test whether a given graphical degree sequence is forcibly connected or not and prove its correctness. We also outline the extensions of the algorithm to test whether a given graphical degree sequence is forcibly k-connected or not for every fixed k ≥ 2. We show through experimental evaluations that the algorithm is efficient on average, though its worst case run time...
متن کاملForcing $k$-repetitions in Degree Sequences
One of the most basic results in graph theory states that every graph with at least two vertices has two vertices with the same degree. Since there are graphs without 3 vertices of the same degree, it is natural to ask if for any fixed k, every graph G is “close” to a graph G′ with k vertices of the same degree. Our main result in this paper is that this is indeed the case. Specifically, we sho...
متن کاملDegenerations of K3 Surfaces of Degree Two
Recall. Let π : X → ∆ be a semistable degeneration of K3 surfaces (i.e. a proper, flat, surjective morphism π : X → ∆ whose general fibre Xt = π−1(t) for t ∈ ∆∗ = ∆ − {0} is a smooth K3 surface, such that X is smooth and X0 := π −1(0) is reduced with normal crossings). Then Kulikov [Kul77] [Kul81] and Persson-Pinkham [PP81] show that we can perform birational modifications that affect only the ...
متن کاملDegree Sequences and the Existence of k-Factors
We consider sufficient conditions for a degree sequence π to be forcibly k-factor graphical. We note that previous work on degrees and factors has focused primarily on finding conditions for a degree sequence to be potentially k-factor graphical. We first give a theorem for π to be forcibly 1-factor graphical and, more generally, forcibly graphical with deficiency at most β ≥ 0. These theorems ...
متن کاملRealizing degree sequences with k-edge-connected uniform hypergraphs
An integral sequence d = (d1, d2, . . . , dn) is hypergraphic if there is a simple hypergraph H with degree sequence d, and such a hypergraph H is a realization of d. A sequence d is r-uniform hypergraphic if there is a simple r-uniform hypergraph with degree sequence d. Similarly, a sequence d is r-uniformmulti-hypergraphic if there is an r-uniformhypergraph (possibly with multiple edges) with...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1980
ISSN: 0012-365X
DOI: 10.1016/0012-365x(90)90284-o